Probabilistic Logic Revisited
نویسنده
چکیده
Before beginning the research that led to "Probabilistic logic" [11 ], I had participated with Richard Duda, Peter Hart, and Georgia Sutherland on the PROSPECTOR project [3]. There, we used Bayes' rule (with some assumptions about conditional independence) to deduce the probabilities of hypotheses about ore deposits given (sometimes uncertain) geologic evidence collected in the field [4]. At that time, I was also familiar with the use of "certainty factors" by Shortliffe [18], the use of "fuzzy logic" by Zadeh [20], and the Dempster/Shafer formalism [16]. All of these methods made (sometimes implicit and unacknowledged) assumptions about underlying joint probability distributions, and I wanted to know how the mathematics would work out if no such assumptions were made. I began by asking how modus ponens would generalize when one assigned probabilities (instead of binary truth values) to P and P D Q. As can be verified by simple calculations using a Venn diagram, the probability of Q is under-determined in this case but can be bounded as follows:
منابع مشابه
A Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کاملPRISM Revisited: Declarative Implementation of a Probabilistic Programming Language Using Delimited Control
PRISM is a probabilistic programming language based on Prolog augmented with primitives to represent probabilistic choice. PRISM is implemented using a combination of low level support from a modified version of B-Prolog, source level program transformation, and libraries for probabilistic inference and learning implemented in the imperative language C. More recently, developers of probabilisti...
متن کاملExpressiveness of Probabilistic Modal Logics, Revisited
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. Logical characterizations of probabilistic bisimulation and simulation were given by Desharnais et al. These results hold for systems defined on analytic state spaces and assume that there are countably many labels in the case of bisim...
متن کاملA Comparative Study of the Neural Network, Fuzzy Logic, and Nero-fuzzy Systems in Seismic Reservoir Characterization: An Example from Arab (Surmeh) Reservoir as an Iranian Gas Field, Persian Gulf Basin
Intelligent reservoir characterization using seismic attributes and hydraulic flow units has a vital role in the description of oil and gas traps. The predicted model allows an accurate understanding of the reservoir quality, especially at the un-cored well location. This study was conducted in two major steps. In the first step, the survey compared different intelligent techniques to discover ...
متن کاملProbabilistic Seismic Hazard Assessment of Tehran Based on Arias Intensity
A probabilistic seismic hazard assessment in terms of Arias intensity is presented for the city of Tehran. Tehran is the capital and the most populated city of Iran. From economical, political and social points of view, Tehran is the most significant city of Iran. Many destructive earthquakes happened in Iran in the last centuries. Historical references indicate that the old city of Rey and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 59 شماره
صفحات -
تاریخ انتشار 1993